An Efficient Caching Strategy of Hierarchical Clustering and Privacy of data in Named Data Network

In Named Data networking one of the unique features is caching of content in the routers along with shortest path. In-network caching allow users to obtain the contents from nearer intermediate routers, reducing the need for content fetching from the servers often located deep in the network. In the network caching of content is taken by intermediate routers and providing content can be loaded into server. Before performing content forwarding we can generate peer-to-peer shortest route for reduce traffic and also overcome chance of congestion. Finally the response time and the transmission overhead for fetching of contents are reduced. In this paper we are proposed three concepts i.e. authentication of clients or users, generating hierarchical clustering of shortest path, data encryption and decryption. In the named data networking each user will be identify of server by using hash based signature generation algorithm. After completion of authentication process the server will generate hierarchical clustering of nodes in the network. The completion of clustering process the server will generate shortest routing from source node to destination node. Before performing shortest routing the server will find out cluster head by using cluster head election process. After completion of cluster head the server will find out shortest route from source node to destination node by using Nodes Signal Strength Shortest Path Algorithm. After finding shortest route the server will send path to both nodes of source node and destination node. The source node will enter transferred message and encrypt that message by using hybrid bit transpose bioinformatics technique. After completion of encryption process the source node will send to destination node. The destination node will retrieve cipher format data and perform the decryption process of hybrid bit transpose bioinformatics technique. By implementing those concepts we are reduce response time and transmission overhead of content.